In Pursuit of the Dynamic Optimality Conjecture
نویسنده
چکیده
In 1985, Sleator and Tarjan introduced the splay tree, a self-adjusting binary search tree algorithm. Splay trees were conjectured to perform within a constant factor as any offline rotation-based search tree algorithm on every sufficiently long sequence—any binary search tree algorithm that has this property is said to be dynamically optimal. However, currently neither splay trees nor any other tree algorithm is known to be dynamically optimal. Here we survey the progress that has been made in the almost thirty years since the conjecture was first formulated, and present a binary search tree algorithm that is dynamically optimal if any binary search tree algorithm is dynamically optimal.
منابع مشابه
Commodified Discourses, Commodifying Discourses: In Pursuit of a Theoretical Model on the Constitutive Functioning of Academic Discourse in Marketization of Higher Education
Inspired by Fairclough's suggestion of the idea of commodification in higher education, particularly in terms of "the marketization of the discursive practices of universities" (1993, p. 143), the author of the present paper proposes a theoretical basis within which the constitutive functioning of academic discourse in the mentioned process can be understood. In this attempt, Althusser's chain...
متن کاملDynamic Optimality - Almost
We present an O(lg lgn)-competitive online binary search tree, improving upon the best previous (trivial) competitive ratio of O(lgn). This is the first major progress on Sleator and Tarjan’s dynamic optimality conjecture of 1985 that O(1)-competitive binary search trees exist.
متن کاملA Study on Splay Trees
We study the dynamic optimality conjecture, which predicts that splay trees are a form of universally efficient binary search tree, for any access sequence. We reduce this claim to a regular access bound, which seems plausible and might be easier to prove. This approach may be useful to establish dynamic optimality.
متن کاملFrankl's Conjecture for a subclass of semimodular lattices
In this paper, we prove Frankl's Conjecture for an upper semimodular lattice $L$ such that $|J(L)setminus A(L)| leq 3$, where $J(L)$ and $A(L)$ are the set of join-irreducible elements and the set of atoms respectively. It is known that the class of planar lattices is contained in the class of dismantlable lattices and the class of dismantlable lattices is contained in the class of lattices ha...
متن کاملDepartures From Optimality When Pursuing Multiple Approach or Avoidance Goals
This article examines how people depart from optimality during multiple-goal pursuit. The authors operationalized optimality using dynamic programming, which is a mathematical model used to calculate expected value in multistage decisions. Drawing on prospect theory, they predicted that people are risk-averse when pursuing approach goals and are therefore more likely to prioritize the goal in t...
متن کامل